#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;

#define in read()
#define pii pair<int,int>
#define fi first
#define se second
#define FILE(x) freopen(x".in","r",stdin);\
	freopen(x".out","w",stdout);
#define pb push_back

int read(){
	int x = 0,sgn = 1;char ch = getchar();
	for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;
	for(;isdigit(ch);ch = getchar()) x = (x<<1)+(x<<3)+(ch^48);
	return x*sgn;
}

const int N = 105;
const int S = N*N*N;

int mod,n,k;
ll f[N][S];

int main (){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in,k = in,mod = in;
	f[0][0] = 1;
	for(int i = 1;i <= n;i++){
		int up = k * i * (i+1) / 2;
		for(int j = 0;j <= up;j++) f[i][j] = (f[i-1][j] + (j >= i ? f[i][j-i] : 0)) % mod;
		for(int j = up;j >= i * (k + 1);j--) f[i][j] = ((f[i][j] - f[i][j-i*(k+1)]) % mod + mod) % mod;
	}
	for(int i = 1;i <= n;i++){
		ll ans = 0; int l = i-1,r = n-i,up = min(k * l * (l+1) /2,k * r * (r+1) /2);
		for(int j = 0;j <= up;j++)
			ans = (ans + f[l][j] * f[r][j] % mod) % mod;
		ans = ans * (k + 1) % mod;
		printf("%lld\n",(ans+mod-1)%mod);
	}
	return 0;
}

